/**
 * 
 * @author Travis C lynch <travisclynch@student.midlandstech.edu>
 * @version Jan 21 2012
 * <br>
 * <br>
 * <b>Instructions</b>
 * <p>
 * Write a class definition for a CircularList class that implements the interface below. 
 * Note that the list methods involving indices should count from the first element of the list as index 0. 
 * Throw an exception if the index is out-of-bounds.
 * <br>
 * <br>
 * <b>Description</b>
 * <p>
 * <ul>
 * <li>A class that implements the CircularListInterface interface
 * </ul>
 */

public class CircularList<T> implements CircularListInterface<T> {

    private Node<T> head, tail;
    private int count;

    public CircularList() {
        count=0;
        head = null;
        tail = head;
	}

	public void moveFirst() {

	}

	public void moveFirst(int N) {

	}

	public boolean add(T item){
		if(tail!=null){
	        tail.setData(elt);
	        tail.setNext(new Node<T>(null));
	        tail=tail.getNext();
	        count++;
	        return true;
		}else{
			return false;
		}
	}

	public void add(int index, T item) {

	}

	public void clear() {

	}

	public boolean contains(T item) {
		return false;
	}

	public T get(int index) {
		return null;
	}

	public int indexOf(T item) {
		return 0;
	}

	public boolean isEmpty() {
		return count==0;
	}

	public boolean remove(T item) {
		return false;
	}

	public T remove(int index) {
		return null;
	}

	public T set(int index, T element) {
		return null;
	}

	public int size() {
		return count; 
	}

}
